Application of Improved Ant Colony Algorithm in Solving TSP
نویسندگان
چکیده
Using ant colony algorithm to solve TSP (traveling salesman problem) has some disadvantages as easily plunging into local minimum, slow convergence speed and so on. In order to find the optimal path accurately and rapidly, an improved ant colony algorithm is proposed. Experimental results show that the improved ant colony algorithm has better effectiveness for TSP problems solutions.
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملAn Improved ACS Algorithm for the Solutions of Larger TSP Problems
Solving large traveling salesman problem (TSP) in an efficient way is a challenging area for the researchers of computer science. This paper presents a modified version of the ant colony system (ACS) algorithm called Red-Black Ant Colony System (RB-ACS) for the solutions of TSP which is the most prominent member of the combinatorial optimization problem. RB-ACS uses the concept of ant colony sy...
متن کاملA Novel Approach To Solve Tsp Using Ant Colony Optimization
ABSTRACT: Travelling salesman problem (TSP) is a routing problem, which is a sub-problem of many application domains such as transportation, network communication. In this paper, we propose a novel methodology which solves the problem ACO algorithm has defined with well distribution strategy in which total search space area is partition into P numbers of hyper-cubic quadrants where P is the dim...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کامل